Deep neural networks (DNNs) have successfully been applied in many fields in the past decades. However, the increasing number of multiply-and-accumulate (MAC) operations in DNNs prevents their application in resource-constrained and resource-varying platforms, e.g., mobile phones and autonomous vehicles. In such platforms, neural networks need to provide acceptable results quickly and the accuracy of the results should be able to be enhanced dynamically according to the computational resources available in the computing system. To address these challenges, we propose a design framework called SteppingNet. SteppingNet constructs a series of subnets whose accuracy is incrementally enhanced as more MAC operations become available. Therefore, this design allows a trade-off between accuracy and latency. In addition, the larger subnets in SteppingNet are built upon smaller subnets, so that the results of the latter can directly be reused in the former without recomputation. This property allows SteppingNet to decide on-the-fly whether to enhance the inference accuracy by executing further MAC operations. Experimental results demonstrate that SteppingNet provides an effective incremental accuracy improvement and its inference accuracy consistently outperforms the state-of-the-art work under the same limit of computational resources.

电子商务查询通常简短而模棱两可。因此，查询理解通常使用查询重写来消除用户输入查询。在使用电子商务搜索工具时，用户倾向于在购买之前输入多个搜索，我们称之为上下文。这些历史搜索包含有关用户真正购物意图的上下文见解。因此，对此类上下文信息进行建模对于更好的查询重写模型至关重要。但是，现有的查询重写模型忽略了用户的历史行为，而仅考虑即时搜索查询，这通常是一个简短的字符串，提供有关真实购物意图的有限信息。我们建议一个端到端的上下文感知查询重写模型来弥合此差距，从而考虑了搜索上下文。具体而言，我们的模型使用历史记录搜索查询及其包含的单词构建了会话图。然后，我们采用图形注意机制，该机制对交叉关系进行建模并计算会话的上下文信息。随后，模型通过使用聚合网络将上下文信息与即时搜索查询组合来计算会话表示。然后将会话表示形式解码以生成重写的查询。从经验上讲，我们证明了我们方法对各种指标下最先进的方法的优越性。在从线购物平台的内部数据上，通过介绍上下文信息，我们的模型在MRR（平均值等级）指标下取得了11.6％的改善，并在HIT@16度量指标（命中率指标）下提高了20.1％使用最佳基线方法（基于变压器的模型）。

已经提出了图形神经网络（GNN）预训练方法来增强GNN的能力。具体而言，首先在大规模的未标记图上预先训练GNN，然后在单独的小标记图上进行微调，以用于下游应用程序，例如节点分类。一种流行的预训练方法是掩盖一部分边缘，并接受了GNN的培训以恢复它们。但是，这种生成方法遭受了图不匹配。也就是说，输入到GNN偏离原始图的蒙版图。为了减轻此问题，我们提出了DIP-GNN（图神经网络的歧视性预训练）。具体来说，我们训练一个发电机以恢复蒙版边缘的身份，同时，我们训练一个判别器，以区分生成的边缘与原始图的边缘。在我们的框架中，鉴别器看到的图形更好地匹配原始图，因为生成器可以恢复蒙版边缘的一部分。大规模同质和异质图的广泛实验证明了该框架的有效性。

最近的作品显示了深度学习模型在词汇（IV）场景文本识别中的巨大成功。但是，在现实情况下，播音外（OOV）单词非常重要，SOTA识别模型通常在OOV设置上表现较差。受到直觉的启发，即学习的语言先验有限的OOV预言性，我们设计了一个名为Vision语言自适应相互解码器（VLAMD）的框架，以部分解决OOV问题。 VLAMD由三个主要谱系组成。首先，我们建立了一个基于注意力的LSTM解码器，具有两个适应性合并的仅视觉模块，可产生视觉平衡的主分支。其次，我们添加了一个基于辅助查询的自动回归变压器解码头，以进行通用的视觉和语言先验表示学习。最后，我们将这两种设计与双向培训相结合，以进行更多样化的语言建模，并进行相互的顺序解码以获得强烈的结果。我们的方法在IV+OOV和OOV设置上分别实现了70.31 \％和59.61 \％单词的准确性，分别在ECCV 2022 TIE TIE Workshop上的OOV-ST挑战的裁剪单词识别任务上，我们在这两个设置上都获得了第一名。

由于复杂的背景和文本实例的不同变化，场景文本识别是一项具有挑战性的任务。在本文中，我们提出了一个新颖的语义gan和平衡的注意网络（SGBANET），以识别场景图像中的文本。提出的方法首先使用语义gan生成简单的语义功能，然后使用平衡的注意模块识别场景文本。语义GAN旨在使支持域和目标域之间的语义特征分布对齐。与在图像级别执行的传统图像到图像翻译方法不同，语义GAN通过语义生成器模块（SGM）和语义歧视器模块（SDM）在语义级别执行生成和歧视。对于目标图像（场景文本图像），语义生成器模块生成简单的语义特征，这些功能与支持图像（清晰的文本图像）共享相同的特征分布。语义鉴别器模块用于区分支​​持域和目标域之间的语义特征。此外，平衡的注意模块旨在减轻注意力漂移的问题。平衡注意模块首先根据视觉瞥见向量和语义瞥见向量学习平衡参数，然后执行平衡操作以获得平衡的瞥见向量。在六个基准测试的实验，包括常规数据集，即IIIT5K，SVT，ICDAR2013和不规则数据集，即ICDAR2015，SVTP，cute80，验证我们提出的方法的有效性。

自我监督的单眼深度预测提供了一种经济有效的解决方案，以获得每个像素的3D位置。然而，现有方法通常会导致不满意的准确性，这对于自治机器人至关重要。在本文中，我们提出了一种新的两级网络，通过利用低成本稀疏（例如4梁）LIDAR来推进自我监督单眼密集深度学习。与使用稀疏激光雷达的现有方法不同，主要以耗时的迭代后处理，我们的模型保留单眼图像特征和稀疏的LIDAR功能，以预测初始深度图。然后，有效的前馈细化网络进一步设计为校正伪3D空间中这些初始深度图中的错误，其具有实时性能。广泛的实验表明，我们所提出的模型显着优于所有最先进的自我监控方法，以及基于稀疏的激光器的方法，以及对自我监督单眼深度预测和完成任务。通过精确的密集深度预测，我们的模型优于基于最先进的稀疏激光雷达的方法（伪LIDAR ++）在Kitti排行榜上下游任务单眼3D对象检测超过68％。代码可在https://github.com/autoailab/fusiondepth获得

We introduce a new tool for stochastic convex optimization (SCO): a Reweighted Stochastic Query (ReSQue) estimator for the gradient of a function convolved with a (Gaussian) probability density. Combining ReSQue with recent advances in ball oracle acceleration [CJJJLST20, ACJJS21], we develop algorithms achieving state-of-the-art complexities for SCO in parallel and private settings. For a SCO objective constrained to the unit ball in $\mathbb{R}^d$, we obtain the following results (up to polylogarithmic factors). We give a parallel algorithm obtaining optimization error $\epsilon_{\text{opt}}$ with $d^{1/3}\epsilon_{\text{opt}}^{-2/3}$ gradient oracle query depth and $d^{1/3}\epsilon_{\text{opt}}^{-2/3} + \epsilon_{\text{opt}}^{-2}$ gradient queries in total, assuming access to a bounded-variance stochastic gradient estimator. For $\epsilon_{\text{opt}} \in [d^{-1}, d^{-1/4}]$, our algorithm matches the state-of-the-art oracle depth of [BJLLS19] while maintaining the optimal total work of stochastic gradient descent. We give an $(\epsilon_{\text{dp}}, \delta)$-differentially private algorithm which, given $n$ samples of Lipschitz loss functions, obtains near-optimal optimization error and makes $\min(n, n^2\epsilon_{\text{dp}}^2 d^{-1}) + \min(n^{4/3}\epsilon_{\text{dp}}^{1/3}, (nd)^{2/3}\epsilon_{\text{dp}}^{-1})$ queries to the gradients of these functions. In the regime $d \le n \epsilon_{\text{dp}}^{2}$, where privacy comes at no cost in terms of the optimal loss up to constants, our algorithm uses $n + (nd)^{2/3}\epsilon_{\text{dp}}^{-1}$ queries and improves recent advancements of [KLL21, AFKT21]. In the moderately low-dimensional setting $d \le \sqrt n \epsilon_{\text{dp}}^{3/2}$, our query complexity is near-linear.

New architecture GPUs like A100 are now equipped with multi-instance GPU (MIG) technology, which allows the GPU to be partitioned into multiple small, isolated instances. This technology provides more flexibility for users to support both deep learning training and inference workloads, but efficiently utilizing it can still be challenging. The vision of this paper is to provide a more comprehensive and practical benchmark study for MIG in order to eliminate the need for tedious manual benchmarking and tuning efforts. To achieve this vision, the paper presents MIGPerf, an open-source tool that streamlines the benchmark study for MIG. Using MIGPerf, the authors conduct a series of experiments, including deep learning training and inference characterization on MIG, GPU sharing characterization, and framework compatibility with MIG. The results of these experiments provide new insights and guidance for users to effectively employ MIG, and lay the foundation for further research on the orchestration of hybrid training and inference workloads on MIGs. The code and results are released on https://github.com/MLSysOps/MIGProfiler. This work is still in progress and more results will be published soon.

In the scenario of black-box adversarial attack, the target model's parameters are unknown, and the attacker aims to find a successful adversarial perturbation based on query feedback under a query budget. Due to the limited feedback information, existing query-based black-box attack methods often require many queries for attacking each benign example. To reduce query cost, we propose to utilize the feedback information across historical attacks, dubbed example-level adversarial transferability. Specifically, by treating the attack on each benign example as one task, we develop a meta-learning framework by training a meta-generator to produce perturbations conditioned on benign examples. When attacking a new benign example, the meta generator can be quickly fine-tuned based on the feedback information of the new task as well as a few historical attacks to produce effective perturbations. Moreover, since the meta-train procedure consumes many queries to learn a generalizable generator, we utilize model-level adversarial transferability to train the meta-generator on a white-box surrogate model, then transfer it to help the attack against the target model. The proposed framework with the two types of adversarial transferability can be naturally combined with any off-the-shelf query-based attack methods to boost their performance, which is verified by extensive experiments.

Cashews are grown by over 3 million smallholders in more than 40 countries worldwide as a principal source of income. As the third largest cashew producer in Africa, Benin has nearly 200,000 smallholder cashew growers contributing 15% of the country's national export earnings. However, a lack of information on where and how cashew trees grow across the country hinders decision-making that could support increased cashew production and poverty alleviation. By leveraging 2.4-m Planet Basemaps and 0.5-m aerial imagery, newly developed deep learning algorithms, and large-scale ground truth datasets, we successfully produced the first national map of cashew in Benin and characterized the expansion of cashew plantations between 2015 and 2021. In particular, we developed a SpatioTemporal Classification with Attention (STCA) model to map the distribution of cashew plantations, which can fully capture texture information from discriminative time steps during a growing season. We further developed a Clustering Augmented Self-supervised Temporal Classification (CASTC) model to distinguish high-density versus low-density cashew plantations by automatic feature extraction and optimized clustering. Results show that the STCA model has an overall accuracy of 80% and the CASTC model achieved an overall accuracy of 77.9%. We found that the cashew area in Benin has doubled from 2015 to 2021 with 60% of new plantation development coming from cropland or fallow land, while encroachment of cashew plantations into protected areas has increased by 70%. Only half of cashew plantations were high-density in 2021, suggesting high potential for intensification. Our study illustrates the power of combining high-resolution remote sensing imagery and state-of-the-art deep learning algorithms to better understand tree crops in the heterogeneous smallholder landscape.